Polynomial-time approximation scheme - PDFSEARCH.IO - Document Search Engine

Polynomial-time approximation scheme
Results: 52

#	Item
31	Approximate Counting and Markov Chain Monte Carlo A Randomized Approach Arindam Pal Department of Computer Science and Engineering Indian Institute of Technology Delhi Add to Reading List Source URL: www.cse.iitd.ernet.in Language: English - Date: 2011-04-08 01:08:14 Markov models Complexity classes Computational statistics Monte Carlo methods Approximation algorithms Markov chain Monte Carlo Markov chain Polynomial-time approximation scheme Random walk Statistics Theoretical computer science Computational complexity theory
32	SODA15 – Accepted Papers Martin Skutella A note on the ring loading problem Marco Di Summa, Friedrich Eisenbrand, Yuri Faenza and Carsten Moldenhauer. On largest volume simplices and sub-determinants Seth Pettie Add to Reading List Source URL: www.siam.org Language: English - Date: 2014-10-08 09:27:53 NP-complete problems Combinatorial optimization Vertex cover Approximation algorithm Matching Algorithm Linear programming Polynomial-time approximation scheme Maximum cut Theoretical computer science Mathematics Applied mathematics
33	SODA15 – Accepted Papers Martin Skutella A note on the ring loading problem Marco Di Summa, Friedrich Eisenbrand, Yuri Faenza and Carsten Moldenhauer. On largest volume simplices and sub-determinants Seth Pettie Add to Reading List Source URL: www.siam.org Language: English - Date: 2014-10-08 09:27:53 NP-complete problems Combinatorial optimization Vertex cover Approximation algorithm Matching Algorithm Linear programming Polynomial-time approximation scheme Maximum cut Theoretical computer science Mathematics Applied mathematics
34	LNCS[removed]Dual Techniques for Scheduling on a Machine with Varying Speed Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2013-07-12 04:32:05 Mathematics Mathematical optimization Approximation algorithms Complexity classes Planning Job shop scheduling Polynomial-time approximation scheme Scheduling Dynamic programming Operations research Applied mathematics Theoretical computer science
35	A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio Elisabeth G¨ unther∗† Olaf Maurer∗† Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-23 03:18:02 Operations research Analysis of algorithms Mathematical optimization Approximation algorithms Job shop scheduling Polynomial-time approximation scheme Linear programming Scheduling Online algorithm Theoretical computer science Applied mathematics Computational complexity theory
36	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:03 Complexity classes NP-complete problems Mathematical optimization Bin packing problem Operations research Polynomial-time approximation scheme Strongly NP-complete Job shop scheduling Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics
37	Chapter 3: Rounding Data and Dynamic Programming (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:03 Operations research Complexity classes Mathematical optimization Approximation algorithms Job shop scheduling Polynomial-time approximation scheme Knapsack problem Optimization problem Dynamic programming Theoretical computer science Computational complexity theory Applied mathematics
38	Chapter 3: Rounding Data and Dynamic Programming (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-23 06:22:49 Complexity classes NP-complete problems Operations research Mathematical optimization Bin packing problem Polynomial-time approximation scheme Job shop scheduling Knapsack problem Strongly NP-complete Theoretical computer science Computational complexity theory Applied mathematics
39	Approximation Algorithms (ADM III) Martin Skutella TU Berlin WS[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:02 NP-complete problems Complexity classes Operations research Combinatorial optimization Approximation algorithm Linear programming relaxation Set cover problem Polynomial-time approximation scheme Optimization problem Theoretical computer science Computational complexity theory Applied mathematics
40	Curriculum Vitae Marek Karpinski Dept. of Computer Science and Hausdorff Center for Mathematics University of Bonn Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2013-03-27 06:27:04 Complexity classes Approximation algorithms Marek Karpinski Computational problems APX Combinatorial optimization Polynomial-time approximation scheme NP-complete problems Time complexity Theoretical computer science Computational complexity theory Applied mathematics